On Set Theoretically and Cohomologically Complete Intersection Ideals
نویسندگان
چکیده
منابع مشابه
Local Cohomology with Respect to a Cohomologically Complete Intersection Pair of Ideals
Let $(R,fm,k)$ be a local Gorenstein ring of dimension $n$. Let $H_{I,J}^i(R)$ be the local cohomology with respect to a pair of ideals $I,J$ and $c$ be the $inf{i|H_{I,J}^i(R)neq0}$. A pair of ideals $I, J$ is called cohomologically complete intersection if $H_{I,J}^i(R)=0$ for all $ineq c$. It is shown that, when $H_{I,J}^i(R)=0$ for all $ineq c$, (i) a minimal injective resolution of $H_{I,...
متن کاملNew Classes of Set-theoretic Complete Intersection Monomial Ideals
Let ∆ be a simplicial complex and χ be an s-coloring of ∆. Biermann and Van Tuyl have introduced the simplicial complex ∆χ. As a corollary of Theorems 5 and 7 in their 2013 article, we obtain that the Stanley–Reisner ring of ∆χ over a field is Cohen–Macaulay. In this note, we generalize this corollary by proving that the Stanley–Reisner ideal of ∆χ over a field is set-theoretic complete interse...
متن کاملRing graphs and complete intersection toric ideals
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...
متن کاملLocally Complete Intersection Stanley–reisner Ideals
In this paper, we prove that the Stanley–Reisner ideal of any connected simplicial complex of dimension ≥ 2 that is locally complete intersection is a complete intersection ideal. As an application, we show that the Stanley–Reisner ideal whose powers are Buchsbaum is a complete intersection ideal.
متن کاملInformation Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem with n parties, that provides information theoretic security, when t < n 3 parties are corrupted by an active adversary having unbounded computing power. In [16], the authors claimed that their protocol takes six roun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2014
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2014-022-7